Spectral radius, symmetric and positive matrices

نویسنده

  • Zdeněk Dvořák
چکیده

If ρ(A) > 1, then lim n→∞ ‖A‖ =∞. Proof. Recall that A = CJC−1 for a matrix J in Jordan normal form and regular C, and that A = CJnC−1. If ρ(A) = ρ(J) < 1, then J converges to the 0 matrix, and thus A converges to the zero matrix as well. If ρ(A) > 1, then J has a diagonal entry (J)ii = λ n for an eigenvalue λ such that |λ| > 1, and if v is the i-th column of C and v′ the i-th row of C−1, then v′Anv = v′CJnC−1v = ei J ei = λ . Therefore, limn→∞ |v′Anv| = ∞, and thus limn→∞ ‖A‖ =∞.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra

In this paper, we discuss some properties of joint spectral {radius(jsr)} and  generalized spectral radius(gsr)  for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized spectral radius. Some of these are in scalar matrices, but  some are different. For example for a bounded set of scalar matrices,$Sigma$, $r_*...

متن کامل

Some Properties of the Spectral Radius of a Set of Matrices

In this paper we show new formulas for the spectral radius and the spectral subradius of a set of matrices. The advantage of our results is that we express the spectral radius of any set of matrices by the spectral radius of a set of symmetric positive definite matrices. In particular, in one of our formulas the spectral radius is expressed by singular eigenvalues of matrices, whereas in the ex...

متن کامل

Lower bounds for the spectral radius of a matrix

In this paper we develop lower bounds for the spectral radius of symmetric , skew{symmetric, and arbitrary real matrices. Our approach utilizes the well{known Leverrier{Faddeev algorithm for calculating the co-eecients of the characteristic polynomial of a matrix in conjunction with a theorem by Lucas which states that the critical points of a polynomial lie within the convex hull of its roots....

متن کامل

Cartesian decomposition of matrices and some norm inequalities

Let ‎X be an ‎‎n-‎‎‎‎‎‎square complex matrix with the ‎Cartesian decomposition ‎‎X = A + i ‎B‎‎‎‎‎, ‎where ‎‎A ‎and ‎‎B ‎are ‎‎‎n ‎‎times n‎ ‎Hermitian ‎matrices. ‎It ‎is ‎known ‎that ‎‎$Vert X Vert_p^2 ‎leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)‎‎‎$, ‎where ‎‎$‎p ‎‎geq 2‎$‎ ‎and ‎‎$‎‎Vert . Vert_p$ ‎is ‎the ‎Schatten ‎‎‎‎p-norm.‎ ‎‎ ‎‎In this paper‎, this inequality and some of its improvements ...

متن کامل

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

Some results on higher numerical ranges and radii of quaternion matrices

‎Let $n$ and $k$ be two positive integers‎, ‎$kleq n$ and $A$ be an $n$-square quaternion matrix‎. ‎In this paper‎, ‎some results on the $k-$numerical range of $A$ are investigated‎. ‎Moreover‎, ‎the notions of $k$-numerical radius‎, ‎right $k$-spectral radius and $k$-norm of $A$ are introduced‎, ‎and some of their algebraic properties are studied‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016